Numerical Methods for Propagating Fronts

نویسنده

  • James A. Sethian
چکیده

In many physical problems, a key aspect is the motion of a propagating front separating two components. As fundamental as this may be, the development of a numerical algorithm to accurately track the moving front is difficult. In this report, we describe some previous theoretical and numerical work. We begin with two examples to motivate the problem, followed by some analytical results. These theoretical results are then used as a foundation for two different types of numerical schemes. Finally, we describe the application of one of these schemes to our work in combustion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structural stability and renormalization group for propagating fronts.

A solution to a given equation is structurally stable if it suffers only an infinitesimal change when the equation (not the solution) is perturbed infinitesimally. We have found that structural stability can be used as a velocity selection principle for propagating fronts. We give examples, using numerical and renormalization group methods. PACS Nos. 03.40.Kf, 68.10.Gw, 47.20.K ∗ Present Addres...

متن کامل

Fronts between Hopf- and Turing-type domains in a two-component reaction-diffusion system

Propagating and standing fronts between Hopfand Turing-type domains are observed experimentally on a one-dimensional array of resistively coupled nonlinear LC-oscillators describable by a two-component reaction-diffusion equation. Numerical and experimental results are compared in particular with respect to front velocities. In the neighbourhood of a codimension-two point two coupled Ginzburg-L...

متن کامل

Fronts Propagating with Curvature Dependent Speed: Algorithms Based on Hamilton-Jacobi Formulations

We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from...

متن کامل

Massively Parallel Computation of Sti Propagating

In this paper we study the computation of combustion fronts using MIMD architecture. Our applications in gas combustion, solid combustion as well as frontal poly-merization are characterized by stii fronts that propagate with nonlinear dynamics. The multiple scale phenomena under consideration lead to very intense computation. The understanding of the mechanism of instabilities is the goal of o...

متن کامل

A fast marching level set method for monotonically advancing fronts.

A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential equation for a propagating level set function and use techniques borrowed from hyperbolic conserv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987